Layered Drawings of Directed Graphs in Three Dimensions
نویسندگان
چکیده
We introduce a new graph drawing convention for 3D layered drawings of directed graphs. The vertex set is partitioned into layers with all edges pointing in the same direction. The layers occupy parallel planes and vertices in each layer occupy two parallel lines. Thus, the traditional 2D layered drawing of a directed graph is split into two vertical walls each containing a 2D layered drawing. We outline a technique for 3D layered digraph drawing which is an extension to the well-known Sugiyama method for 2D layered digraph drawing, and we also present some experimental results.
منابع مشابه
Layered Drawings of Graphs with Crossing Constraints
We study the problem of producing hierarchical drawings of layered graphs when some pairs of edges are not allowed to cross. We show that deciding on the existence of a drawing satisfying at least k constraints from a given set of non-crossing constraints is NP-complete even if the graph is 2-layered and even when the permutation of the vertices on one side of the bipartition is fixed. We also ...
متن کاملElements for the Description of Fitness Landscapes Associated with Local Operators for Layered Drawings of Directed Graphs
Abstract Minimizing arc crossings for drawing acyclic digraphs is a well-known NPcomplete problem for which several local-search approaches based on local transformations (switching, median ,...) have been proposed. Their adaptations have been recently included in different metaheuristics. As an attempt to better understand the dynamic of the search processes, we study the fitness landscapes as...
متن کاملVolume Requirements of 3D Upward Drawings
This paper studies the problem of drawing directed acyclic graphs in three dimensions in the straight-line grid model, and so that all directed edges are oriented in a common (upward) direction. We show that there exists a family of outerplanar directed acyclic graphs whose volume requirement is super-linear. We also prove that for the special case of rooted trees a linear volume upper bound is...
متن کاملCharacterization of Layered Graphs with the Minimum Number of Dummy Vertices
We describe details of the structure and the dimensions of layered directed acyclic graphs (DAGs) with the minimum number of dummy vertices. The theoretical results presented in this paper can provide the necessary background for developing more efficient layering heuristics as well as for building a more complete picture of the nature of layered DAGs.
متن کاملA Fast Multi-Dimensional Algorithm for Drawing Large Graphs
We present a novel hierarchical force-directed method for drawing large graphs. The algorithm produces a graph embedding in an Euclidean space E of any dimension. A two or three dimensional drawing of the graph is then obtained by projecting a higher-dimensional embedding into a two or three dimensional subspace of E. Projecting high-dimensional drawings onto two or three dimensions often resul...
متن کامل